首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3969篇
  免费   223篇
  国内免费   409篇
化学   1440篇
晶体学   11篇
力学   37篇
综合类   20篇
数学   2722篇
物理学   371篇
  2024年   2篇
  2023年   56篇
  2022年   71篇
  2021年   78篇
  2020年   115篇
  2019年   120篇
  2018年   116篇
  2017年   103篇
  2016年   74篇
  2015年   90篇
  2014年   144篇
  2013年   583篇
  2012年   108篇
  2011年   153篇
  2010年   119篇
  2009年   197篇
  2008年   237篇
  2007年   258篇
  2006年   234篇
  2005年   218篇
  2004年   211篇
  2003年   194篇
  2002年   175篇
  2001年   136篇
  2000年   134篇
  1999年   108篇
  1998年   104篇
  1997年   116篇
  1996年   64篇
  1995年   43篇
  1994年   33篇
  1993年   36篇
  1992年   34篇
  1991年   17篇
  1990年   10篇
  1989年   16篇
  1988年   16篇
  1987年   6篇
  1986年   7篇
  1985年   17篇
  1984年   11篇
  1983年   4篇
  1982年   5篇
  1981年   5篇
  1980年   5篇
  1978年   4篇
  1977年   3篇
  1976年   3篇
  1974年   2篇
  1973年   2篇
排序方式: 共有4601条查询结果,搜索用时 15 毫秒
61.
Yibo Yang 《代数通讯》2017,45(9):3691-3702
We investigate pointed Hopf algebras over finite nilpotent groups of odd order, with nilpotency class 2. For such a group G, we show that if its commutator subgroup coincides with its center, then there exists no non-trivial finite-dimensional pointed Hopf algebra with kG as its coradical. We apply these results to non-abelian groups of order p3, p4 and p5, and list all the pointed Hopf algebras of order p6, whose group of grouplikes is non-abelian.  相似文献   
62.
Tobias Kildetoft 《代数通讯》2017,45(6):2325-2333
We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: position reducible (PR)-groups, inductively position reducible (IPR)-groups and weak IPR-groups. We show that IPR-groups and weak IPR-groups are solvable and satisfy the Taketa inequality (ie, that the derived length of the group is at most the number of degrees of irreducible complex characters of the group), and we show that any M-group is a weak IPR-group. We also show that even though PR-groups need not be solvable, they cannot be perfect.  相似文献   
63.
Khalid Bou-Rabee  Chen Shi 《代数通讯》2017,45(10):4370-4379
The commensurability index between two subgroups A,B of a group G is [A:AB][B:AB]. This gives a notion of distance among finite index subgroups of G, which is encoded in the p-local commensurability graphs of G. We show that for any metabelian group, any component of the p-local commensurabilty graph of G has diameter bounded above by 4. However, no universal upper bound on diameters of components exists for the class of finite solvable groups. In the appendix we give a complete classification of components for upper triangular matrix groups in GL(2,𝔽q).  相似文献   
64.
We give a negative answer to a question by J. M. Landsberg on the nature of normalizations of orbit closures. A counterexample originates from the study of complex, ternary, cubic forms.  相似文献   
65.
A semigroup S is called an equational domain if any finite union of algebraic sets over S is algebraic. We give some necessary and su?cient conditions for a completely simple semigroup to be an equational domain.  相似文献   
66.
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSpace-complete. Additionally, we provide simpler constructions for the uniform word problems of these classes. For the uniform word problem for automaton groups (without rational constraints), we show NL-hardness. Finally, we investigate a question asked by Cain about a better upper bound for the length of a word on which two distinct elements of an automaton semigroup must act differently.A detailed listing of the contributions of this paper can be found at the end of this paper.  相似文献   
67.
主要研究对称正定矩阵群上的内蕴最速下降算法的收敛性问题.首先针对一个可转化为对称正定矩阵群上无约束优化问题的半监督度量学习模型,提出对称正定矩阵群上一种自适应变步长的内蕴最速下降算法.然后利用李群上的光滑函数在任意一点处带积分余项的泰勒展开式,证明所提算法在对称正定矩阵群上是线性收敛的.最后通过在分类问题中的数值实验说明算法的有效性.  相似文献   
68.
69.
70.
This note is about the Chow groups of a certain family of smooth cubic fourfolds. This family is characterized by the property that each cubic fourfold X in the family has an involution such that the induced involution on the Fano variety F of lines in X is symplectic and has a K3 surface S in the fixed locus. The main result establishes a relation between X and S on the level of Chow motives. As a consequence, we can prove finite-dimensionality of the motive of certain members of the family.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号